Efficient Routing Algorithms on Optoelectronic Networks

نویسندگان

  • J. Al-SADI
  • AHMAD M. AWWAD
چکیده

This paper proposes an efficient fault tolerant routing algorithm for the class of optoelectronic networks. Extended Optoelectronic Cube interconnection network; EOC for short; is introduced as a new member of this family. EOC is constructed from multiplying the hypercube as a factor network by it self. In this paper we utilize the features of optoelectronic networks which use both of electronic and optical networks. The EOC utilizes the good features of the Hypercube network due to its attractive features in terms of connectivity, semantic, low diameter, and multiple alternative paths in addition to the extended Optoelectronic capabilities of using both electronic and optical technologies. In this new proposed algorithm, each node A starts by computing the first level unsafety set, A S1 , composed of the set of unreachable direct neighbours. It then performs m-1 exchanges with its neighbours to determine the k-level unsafety sets A k S for all 1 ≤ k ≤ m, where m is an adjustable parameter between 1 and 2n. The k-level unsafety set at node A represents the set of all faulty nodes at Hamming distance k from A which either faulty or unreachable from A due to faulty nodes or links.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MLCA: A Multi-Level Clustering Algorithm for Routing in Wireless Sensor Networks

Energy constraint is the biggest challenge in wireless sensor networks because the power supply of each sensor node is a battery that is not rechargeable or replaceable due to the applications of these networks. One of the successful methods for saving energy in these networks is clustering. It has caused that cluster-based routing algorithms are successful routing algorithm for these networks....

متن کامل

Broadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach

While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...

متن کامل

Routing Improvement for Vehicular Ad Hoc Networks (VANETs) Using Nature Inspired Algorithms

are a subset of MANETs in which vehicles are considered as network clients. These networks have been created to communicate between vehicles and traffic control on the roads. have similar features to MANETs and their main special property is the high-speed node mobility which makes a quick change of the network. The rapid change of network topology is a major challenge in routing. One of the we...

متن کامل

A New Routing Algorithm for Vehicular Ad-hoc Networks based on Glowworm Swarm Optimization Algorithm

Vehicular ad hoc networks (VANETs) are a particular type of Mobile ad hoc networks (MANET) in which the vehicles are considered as nodes. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles. In this paper, a new routing protocol based on glowworm swarm optimization algorithm is provided. Using the g...

متن کامل

Improvement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm

Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006